Increased Scheduling Quality by Utilizing the Flexibility of Malleable Jobs

نویسنده

  • Jan Hungershöfer
چکیده

To accomplish both, the demand of the users of parallel systems for a low response time and the ambition of the system maintainers for a high utilization, is hard to do. A high utilization normally results in long waiting times for the users’ jobs. An alternative to the standard jobs with fixed width are more flexible jobs models. They allow to change the job’s width at application start (moldable jobs) or even during execution (malleable jobs). We have analyzed the quality of schedules using job sets with moldable and malleable jobs and combinations of both. Tracefiles from supercomputer installations have been modified to contain varying fractions of moldable and malleable jobs. Using a special simulation environment for the more flexible job models the jobs have been scheduled virtually. The results show that using this job models both interest groups mentioned above can be pleased.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On scheduling malleable jobs to minimise the total weighted completion time

This paper is about scheduling parallel jobs, i.e. which can be executed on more than one processor at the same time. Malleable jobs is a special class of parallel jobs. The number of processors a malleable job is executed on may change during the execution. In this work, we consider the NP-hard problem of scheduling malleable jobs to minimize the total weighted completion time or mean weighted...

متن کامل

Dynamic Resource Management and Job Scheduling for High Performance Computing = Dynamisches Ressourcenmanagement und Job-Scheduling für das Hochleistungsrechnen

Job scheduling and resource management plays an essential role in high-performance computing. Supercomputing resources are usually managed by a batch system, which is responsible for the effective mapping of jobs onto resources (i.e., compute nodes). From the system perspective, a batch system must ensure high system utilization and throughput, while from the user perspective it must ensure fas...

متن کامل

A dominant class of schedules for malleable jobs in the problem to minimize the total weighted completion time

This paper is about scheduling parallel jobs, i.e. which can be executed on more than one machine at the same time. Malleable jobs is a special class of parallel jobs. The number of machines a malleable job is executed on may change during its execution. In this work, we consider the NP-hard problem of scheduling malleable jobs to minimize the total weighted completion time (or mean weighted fl...

متن کامل

Scalable hierarchical scheduling for malleable parallel jobs on multiprocessor-based systems

The proliferation of multi-core and multiprocessor-based computer systems has led to explosive development of parallel applications and hence the need for efficient schedulers. In this paper, we study hierarchical scheduling for malleable parallel jobs on multiprocessor-based systems, which appears in many distributed and multilayered computing environments. We propose a hierarchical scheduling...

متن کامل

Precedence-Constrained Scheduling of Malleable Jobs with Preemption

Scheduling jobs with precedence constraints on a set of identical machines to minimize the total processing time (makespan) is a fundamental problem in combinatorial optimization. In practical settings such as cloud computing, jobs are often malleable, i.e., can be processed on multiple machines simultaneously. The instantaneous processing rate of a job is a non-decreasing function of the numbe...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2004